Intersection problems in the q-ary cube

نویسندگان

  • Peter Frankl
  • Norihide Tokushige
چکیده

We propose new intersection problems in the q-ary n-dimensional hypercube. The answers to the problems include the Katona’s t-intersection theorem and the Erdős–Ko–Rado theorem as special cases. We solve some of the basic cases of our problems, and for example we get an Erdős–Ko–Rado type result for t-intersecting k-uniform families of multisets with bounded repetitions. Another example is obtained by counting the number of lattice points in a polytope having an intersection property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On new completely regular q-ary codes

In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

متن کامل

Identifying Codes in q-ary Hypercubes

Let q be any integer ≥ 2. In this paper, we consider the q-ary ndimensional cube whose vertex set is Znq and two vertices (x1, . . . , xn) and (y1, . . . , yn) are adjacent if their Lee distance is 1. As a natural extension of identifying codes in binary Hamming spaces, we further study identifying codes in the above q-ary hypercube. We let M t (n) denote the smallest cardinality of t-identifyi...

متن کامل

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

ar X iv : 1 10 4 . 12 93 v 1 [ m at h . C O ] 7 A pr 2 01 1 On perfect 2 - colorings of the q - ary n - cube ∗

A coloring of the q-ary n-dimensional cube (hypercube) is called perfect if, for every n-tuple x, the collection of the colors of the neighbors of x depends only on the color of x. A Boolean-valued function is called correlation-immune of degree n − m if it takes the value 1 the same number of times for each m-dimensional face of the hypercube. Let f = χ be a characteristic function of some sub...

متن کامل

New completely regular q-ary codes based on Kronecker products

For any integer ρ ≥ 1 and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d = 3 and with covering radius ρ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius ρ,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 141  شماره 

صفحات  -

تاریخ انتشار 2016